Complete graph minors and the graph minor structure theorem
نویسندگان
چکیده
منابع مشابه
Complete graph minors and the graph minor structure theorem
Article history: Received 19 May 2011 Available online xxxx
متن کاملOptimizing the Graph Minors Weak Structure Theorem
Abstract. One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65–110, 1995], also known as the weak structure theorem, reveals the local structure of graphs excluding some graph as a minor: each such graph G either has small treewidth or contains the subdivision of a planar graph (a wall) that can be arrang...
متن کاملThe Graph Minor Theorem
2 Properties excluding a planar graph 3 2.1 Path-width and tree-width . . . . . . . . . . . . . . . . . . . . . . 3 2.2 Excluding a forest . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.3 Planar graphs and sleeve unions . . . . . . . . . . . . . . . . . . 10 2.4 Planar graphs and grids . . . . . . . . . . . . . . . . . . . . . . . 13 2.5 Families with bounded tree-width . . . . . . . ....
متن کاملAn accessibility theorem for infinite graph minors
In his recent collection [ 2 ] of open problems about infinite graphs, Halin defines the following hierarchy of graphs. He defines Γ0 to be the class of all graphs (finite or infinite), and for each ordinal μ > 0 he defines Γμ as the class of all graphs containing, for each λ < μ, infinitely many disjoint connected graphs from Γλ. Thus, Γ1 is the class of infinite graphs, Γ2 is the class of all...
متن کاملGraph Minors
For a given graph G and integers b, f ≥ 0, let S be a subset of vertices of G of size b + 1 such that the subgraph of G induced by S is connected and S can be separated from other vertices of G by removing f vertices. We prove that every graph on n vertices contains at most n/ b+f b such vertex subsets. This result from extremal combinatorics appears to be very useful in the design of several e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2013
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2012.09.001